Gaussian Process Constraint Learning for Scalable Chance-Constrained Motion Planning From Demonstrations
نویسندگان
چکیده
We propose a method for learning constraints represented as Gaussian processes (GPs) from locally-optimal demonstrations. Our approach uses the Karush-Kuhn-Tucker (KKT) optimality conditions to determine where on demonstrations constraint is tight, and scaling of gradient at those states. then train GP representation which consistent with generalizes this information. further show that uncertainty can be used within kinodynamic RRT plan probabilistically-safe trajectories, we exploit structure planner exactly achieve specified safety probability. demonstrate our learn complex, nonlinear demonstrated 5D nonholonomic car, 12D quadrotor, 3-link planar arm, all while requiring minimal prior information constraint. results suggest learned accurate, outperforming previous methods require more a priori knowledge.
منابع مشابه
Learning Motion Skills from Expert Demonstrations and Own Experience using Gaussian Process Regression
While today’s industrial robots achieve high performance in a wide range of tasks, the programming and adaptation of such robots to new tasks is still time-consuming and far from convenient. This shortcoming is a major obstacle for the deployment of robots in small to medium-size companies and also for service applications. Robot learning by imitation has been identified as an important paradig...
متن کاملMethods for Learning Control Policies from Variable-Constraint Demonstrations
Many everyday human skills can be framed in terms of performing some task subject to constraints imposed by the task or the environment. Constraints are usually not observable and frequently change between contexts. In this chapter, we explore the problem of learning control policies from data containing variable, dynamic and non-linear constraints onmotion.We discuss how an effective approach ...
متن کاملSOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملLearning to Plan for Constrained Manipulation from Demonstrations
Motion planning in high dimensional state spaces, such as for mobile manipulation, is a challenging problem. Constrained manipulation, e.g. opening articulated objects like doors or drawers, is also hard since sampling states on the constrained manifold is expensive. Further, planning for such tasks requires a combination of planning in free space for reaching a desired grasp or contact locatio...
متن کاملScalable Log Determinants for Gaussian Process Kernel Learning
For applications as varied as Bayesian neural networks, determinantal point processes, elliptical graphical models, and kernel learning for Gaussian processes (GPs), one must compute a log determinant of an n× n positive definite matrix, and its derivatives – leading to prohibitive O(n) computations. We propose novel O(n) approaches to estimating these quantities from only fast matrix vector mu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE robotics and automation letters
سال: 2022
ISSN: ['2377-3766']
DOI: https://doi.org/10.1109/lra.2022.3148436